Four-moduli set (2, 2n−1, 2n+2n−1−1, 2n+1+2n−1) simplies the residue to binary converters based on CRT II
نویسندگان
چکیده
منابع مشابه
Residue-to-Binary Converters for the Moduli Set {22n+1−1,22n,2n−1}
In this paper, we propose two memoryless converters for the moduli set {22n+1 − 1,2,2 − 1}. First, we propose a novel reverse converter, which is purely adder based, using the traditional Chinese Remainder Theorem (CRT). Second, due to the fact that the proposed CRT based structure does not cover the entire dynamic range, a second converter, which covers the entire dynamic range based on Mixed ...
متن کاملResidue-to-Binary Arithmetic Converter for the Moduli Set
In this paper we investigate residue number system to binary converter algorithms for special moduli sets. A new five moduli set proposed is shown to exhibit high speed forward and reverse conversion properties. The architectures are memoryless and area efficient.
متن کاملA Residue to Binary Converter for the {2n + 2, 2n + 1, 2n} Moduli Set
In this paper, we investigate Residue Number System (RNS) to decimal conversion for a three moduli set with a common factor. We propose a new RNS to binary converter for the moduli set {2n + 2, 2n + 1, 2n} for any even integer n > 0. First, we demonstrate that for such a moduli set, the computation of the multiplicative inverses can be eliminated. Secondly, we simplify the Chinese Remainder The...
متن کاملNew Arithmetic Residue to Binary Converters
The residue number system (RNS) is a carry-free number system which can support high-speed and parallel arithmetic. Two major issues in efficient design of RNS systems are the moduli set selection and the residue to binary conversion. In this paper, we present two efficient residue to binary converters for the new three-moduli set {2, 2 + 1, 2 – 1}. This moduli set consists of pairwise relative...
متن کاملMemoryless RNS-to-binary converters for the {2n+1 - 1, 2n, 2n - 1} moduli set
In this paper, we propose two novel memoryless reverse converters for the moduli set {2 − 1, 2, 2 − 1}. The first proposed converter does not entirely cover the dynamic range while the second proposed converter covers the entire dynamic range. First, we simplify the Chinese Remainder Theorem in order to obtain a reverse converter that utilizes mod-(2 − 1) operation. Second, we further reduce th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2002
ISSN: 0898-1221
DOI: 10.1016/s0898-1221(02)00280-8